A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion

نویسنده

  • Shi Li
چکیده

In the Edge-Disjoint Paths with Congestion problem (EDPwC), we are given an undirected n-vertex graph G, a collection M = {(s1, t1), . . . , (sk, tk)} of demand pairs and an integer c. The goal is to connect the maximum possible number of the demand pairs by paths, so that the maximum edge congestion the number of paths sharing any edge is bounded by c. When the maximum allowed congestion is c = 1, this is the classical Edge-Disjoint Paths problem (EDP). The best current approximation algorithm for EDP achieves an O( √ n)-approximation, by rounding the standard multicommodity flow relaxation of the problem. This matches the Ω( √ n) lower bound on the integrality gap of this relaxation. We show an O(poly log k)-approximation algorithm for EDPwC with congestion c = 2, by rounding the same multi-commodity flow relaxation. This gives the best possible congestion for a sub-polynomial approximation of EDPwC via this relaxation. Our results are also close to optimal in terms of the number of pairs routed, since EDPwC is known to be hard to approximate to within a factor of Ω̃ ( (logn) ) for any constant congestion c. Prior to our work, the best approximation factor for EDPwC with congestion 2 was Õ(n), and the best algorithm achieving a polylogarithmic approximation required congestion 14. Keywords-approximation algorithms; network routing; edgedisjoint paths

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2

In the Edge-Disjoint Paths with Congestion problem (EDPwC), we are given an undirected nvertex graph G, a collectionM = {(s1, t1), . . . , (sk, tk)} of demand pairs and an integer c. The goal is to connect the maximum possible number of the demand pairs by paths, so that the maximum edge congestion the number of paths sharing any edge is bounded by c. When the maximum allowed congestion is c = ...

متن کامل

Analysis of an ( )-Approximation Algorithm for the Maximum Edge-Disjoint Paths Problem with Congestion Two

The edge-disjoint paths problem (EDPP) has been studied for a long time by graph theorists and algorithm developers for combinatorial optimization. In its most basic form, the EDPP is as follows: given a graph and a set of pairs of vertices/terminals for in decide whether or not has edge-disjoint paths connecting the given pairs of terminals. This problem is equivalent to finding vertex-disjoin...

متن کامل

Hardness of Low Congestion Routing in Directed Graphs

We prove a strong inapproximability result for routing on directed graphs with low congestion. Given as input a directed graph on N vertices and a set of source-destination pairs that can be connected via edge-disjoint paths, we prove that it is hard, assuming NP doesn’t have n log n) time randomized algorithms, to route even a 1/N fraction of the pairs, even if we are allowed to use each edge ...

متن کامل

Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion

We consider the Maximum Node Disjoint Paths (MNDP) problem in undirected graphs. The input consists of an undirected graph G = (V,E) and a collection {(s1, t1), . . . , (sk, tk)} of k source-sink pairs. The goal is to select a maximum cardinality subset of pairs that can be routed/connected via node-disjoint paths. A relaxed version of MNDP allows up to c paths to use a node, where c is the con...

متن کامل

New Hardness Results for Undirected Edge Disjoint Paths

In the edge-disjoint paths (EDP) problem, we are given a graph G and a set of source-sink pairs in G. The goal is connect as many pairs as possible in an edge-disjoint manner. This problem is NP-hard and the best known approximation algorithm gives an Õ(min{n2/3,√m})-approximation for both directed and undirected graphs; here n and m denote the number of vertices and edges in G respectively. Fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012